Shape reconstruction from unorganized cross-sections
نویسندگان
چکیده
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications where cross-sections of human organs are obtained by means of a free hand ultrasound apparatus. The position and orientation of the cutting planes may be freely chosen which makes the problem substantially more difficult than in the case of parallel cross-sections, for which a rich literature exists. The input data consist of the cutting planes and (an approximation of) their intersection with the object. Our approach consists of two main steps. First, we compute the arrangement of the cutting planes. Then, in each cell of the arrangement, we reconstruct an approximation of the object from its intersection with the boundary of the cell. Lastly, we glue the various pieces together. The method makes use of the Delaunay triangulation and generalizes the reconstruction method of Boissonnat and Geiger [BG93] for the case of parallel planes. The analysis provides a neat characterization of the topological properties of the result and, in particular, shows an interesting application of Moebius diagrams to compute the locus of the branching points. We have implemented our algorithm in C++, using the [CGAL] library. Experimental results show that the algorithm performs well and can handle complicated branching configurations.
منابع مشابه
Provably Good 2D Shape Reconstruction from Unorganized Cross-Sections
This paper deals with the reconstruction of 2-dimensional geometric shapes from unorganized 1-dimensional cross-sections. We study the problem in its full generality following the approach of Boissonnat and Memari [BM07] for the analogous 3D problem. We propose a new variant of this method and provide sampling conditions to guarantee that the output of the algorithm has the same topology as the...
متن کامل3D Reconstruction from Sparse Unorganized Cross Sections
In this thesis work, we propose an algorithm for smooth 3D object reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on construction of a globally consistent signed distance function over the cutting planes. It uses a divide-and-conquer approach utilizing Hermite...
متن کامل3D Surface Reconstruction from Unorganized Sparse Cross Sections
In this paper, we propose an algorithm for closed and smooth 3D surface reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on the construction of a globally consistent signed distance function over the cutting planes. It uses a split-and-merge approach utilising ...
متن کاملSECTION II Surface Reconstruction from Unorganized Data Sets Through Point Based Edge Segmentation
The general problem of 3D shape reconstruction from unorganized data sets can be described as follows: Given 3D range data or dense 3D scattered point sets sampled on or near an unknown object surface, reconstruct the topological and geometrical structures represented by the data points. The data points should be approximated by a set of smooth, connected surface patches such that the accuracy ...
متن کامل